The Legendre-Fenchel transform from a category theoretic perspective

نویسنده

  • Simon Willerton
چکیده

The Legendre-Fenchel transform is a classical piece of mathematics with many applications. In this paper we show how it arises in the context of category theory using categories enriched over the extended real numbers R := [−∞,+∞]. A key ingredient is Pavlovic’s “nucleus of a profunctor” construction. The pairing between a vector space and its dual can be viewed as an R-profunctor; the construction of the nucleus of this profunctor is the construction of a lot of the theory of the Legendre-Fenchel transform. For a relation between sets viewed as a {true, false}-valued profunctor, the construction of the nucleus is the construction of the Galois connection associated to the relation. One insight given by this approach is that the relevant structure on the function spaces involved in the Legendre-Fenchel transform is something like a metric but is asymmetric and can take negative values. This ‘Rstructure’ is a considerable refinement of the usual partial order on realvalued function space and it allows a natural interpretation of Toland-Singer duality and of the two tropical module structures on the set of convex functions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Legendre-Fenchel Conjugate: Numerical Computation

This paper describes a numerical implementation in Maple V R. 5 of an algorithm to compute the Legendre–Fenchel conjugate, namely the Linear-time Legendre Transform algorithm. After a brief motivation on the importance of the Legendre–Fenchel transform, we illustrate the information the conjugate gives (how to test for convexity or compacity, and how to smooth a convex function), with several e...

متن کامل

Parametric Computation of the Legendre-fenchel Conjugate with Application to the Computation of the Moreau Envelope

A new algorithm, named the Parametric Legendre Transform (PLT) algorithm, to compute the Legendre-Fenchel conjugate of a convex function of one variable is presented. It returns a parameterization of the graph of the conjugate except for some affine parts corresponding to nondifferentiable points of the function. The approach is extended to the computation of the Moreau envelope, resulting in a...

متن کامل

Convexity Conditions and the Legendre-Fenchel Transform for the Product of Finitely Many Positive Definite Quadratic Forms

While the product of finitely many convex functions has been investigated in the field of global optimization, some fundamental issues such as the convexity condition and the LegendreFenchel transform for the product function remain unresolved. Focusing on quadratic forms, this paper is aimed at addressing the question: When is the product of finitely many positive definite quadratic forms conv...

متن کامل

Lp-norms, Log-barriers and Cramer transform in Optimization

We show that the Laplace approximation of a supremum by L-norms has interesting consequences in optimization. For instance, the logarithmic barrier functions (LBF) of a primal convex problem P and its dual P∗ appear naturally when using this simple approximation technique for the value function g of P or its Legendre-Fenchel conjugate g∗. In addition, minimizing the LBF of the dual P∗ is just e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018